Groups of finite elementary codes = Groupes des codes élémentaires finisKATSURA, M; TANAKA, G.Theoretical computer science. 1993, Vol 108, Num 1, pp 119-149, issn 0304-3975Conference Paper

String matching problems over free partially commutative monoids = Les problèmes de mise en correspondance de chaîne de caractères sur des monoïdes libres partiellement commutatifsHASHIGUCHI, K; YAMADA, K.Information and computation (Print). 1992, Vol 101, Num 2, pp 131-149, issn 0890-5401Article

Endomorphisms of graphs. II: Various unretractive graphsKNAUER, U.Archiv der Mathematik. 1990, Vol 55, Num 2, pp 193-203, issn 0003-889X, 11 p.Article

On coding morphisms for zigzag codes = Les morphismes de codages pour les codes ZIGZAGDO LONG VAN; LE SAËC, B; LITOVSKY, I et al.Informatique théorique et applications (Imprimé). 1992, Vol 26, Num 6, pp 565-580, issn 0988-3754Article

Notions of hyperbolicity in monoidsHOFFMANN, Michael; THOMAS, Richard M.Theoretical computer science. 2010, Vol 411, Num 4-5, pp 799-811, issn 0304-3975, 13 p.Conference Paper

On deciding whether a monoid is a free monoid or is a groupOTTO, F.Acta informatica. 1986, Vol 23, Num 1, pp 99-110, issn 0001-5903Article

Left proper E-dense monoidsFOUNTAIN, J; GOMES, G. M. S.Journal of pure and applied algebra. 1992, Vol 80, Num 1, pp 1-27, issn 0022-4049Article

Locally commutative categoriesCHATTOPADHYAY, Arkadev; THERIEN, Denis.Lecture notes in computer science. 2003, pp 984-995, issn 0302-9743, isbn 3-540-40493-7, 12 p.Conference Paper

Some results on the centralizers of monoids in clone theoryMACHIDA, Hajime; MIYAKAWA, Masahiro; ROSENBERG, Ivo G et al.Proceedings - International Symposium on Multiple-Valued Logic. 2002, pp 10-16, issn 0195-623X, isbn 0-7695-1462-6, 7 p.Conference Paper

On diophantine monoids and their class groupsCHAPMAN, Scott T; KRAUSE, Ulrich; OELJEKLAUS, Eberhard et al.Pacific journal of mathematics. 2002, Vol 207, Num 1, pp 125-147, issn 0030-8730, 23 p.Article

Decompositions of recognizable strong maximal codes = Décompositions des codes maximaux forts reconnaissablesLIANG ZHANG; WEIDE QIU.Theoretical computer science. 1993, Vol 108, Num 1, pp 173-183, issn 0304-3975Conference Paper

Involutive monoidal t-norm-based logic and R₀ logicLIU LIANZHEN; LI KAITAI.International journal of intelligent systems. 2004, Vol 19, Num 6, pp 491-497, issn 0884-8173, 7 p.Article

Algorithmes sur les polynômes en variables non commutativesDuchamp, Gérard; Perrin, Dominique.1987, 114 p.Thesis

Parties reconnaissables de monoïdes définis par générateurs et relations = Recognizable parts of monoids defined by generators and relationsLACAZE, J.Informatique théorique et applications (Imprimé). 1992, Vol 26, Num 6, pp 541-552, issn 0988-3754Article

Elements of finite order for finite weight-reducing and confluent Thue systemsPALIATH NARENDRAN; OTTO, F.Acta informatica. 1988, Vol 25, Num 5, pp 573-591, issn 0001-5903Article

CODES ET SOUS-MONOIDES POSSEDANT DES MOTS NEUTRES.PERRIN D; SCHUTZENBERGER MP.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 214; PP. 1-12; ABS. ANGL.; BIBL. 9 REF.Serial Issue

The dual braid monoidBESSIS, David.Annales scientifiques de l'Ecole normale supérieure. 2003, Vol 36, Num 5, pp 647-683, issn 0012-9593, 37 p.Article

Sur la combinatoire des codes à deux mots = About combinatorics of two-words codesBARBIN-LE REST, E; LE REST, M.Theoretical computer science. 1985, Vol 41, Num 1, pp 61-80, issn 0304-3975Article

On the number of factorizations of an element in an atomic monoidCHAPMAN, S. T; GARCIA-GARCIA, J. I; GARCIA-SANCHEZ, P. A et al.Advances in applied mathematics (Print). 2002, Vol 29, Num 3, pp 438-453, issn 0196-8858, 16 p.Article

Le langage des espaces et des groupes quantiques = Quantum spaces and quantum groups languageMALTSINIOTIS, G.Communications in mathematical physics. 1993, Vol 151, Num 2, pp 275-302, issn 0010-3616Article

Nets enriched over closed monoidal structuresBADOUEL, Eric; CHENOU, Jules.Lecture notes in computer science. 2003, pp 64-81, issn 0302-9743, isbn 3-540-40334-5, 18 p.Conference Paper

Monad transformers as monoid transformersJASKELIOFF, Mauro; MOGGI, Eugenio.Theoretical computer science. 2010, Vol 411, Num 51-52, pp 4441-4466, issn 0304-3975, 26 p.Article

Injective positively ordered monoids. IIWEHRUNG, F.Journal of pure and applied algebra. 1992, Vol 83, Num 1, pp 83-100, issn 0022-4049Article

On the rank of the subsets of a free monoidNERAUD, J.Theoretical computer science. 1992, Vol 99, Num 2, pp 231-241, issn 0304-3975Article

Equations and monoid varieties of dot-depth one and twoBLANCHET-SADRI, F.Theoretical computer science. 1994, Vol 123, Num 2, pp 239-258, issn 0304-3975Article